Algorithmic Art Machines

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Verification of Recursive Probabilistic State Machines

Recursive Markov Chains (RMCs) ([EY04]) are a natural abstract model of procedural probabilistic programs and related systems involving recursion and probability. They succinctly define a class of denumerable Markov chains that generalize multi-type branching (stochastic) processes. In this paper, we study the problem of model checking an RMC against a given ω-regular specification. Namely, giv...

متن کامل

Aliasing Artifacts and Accidental Algorithmic Art

While developing a program to render Voronoi diagrams, I accidentally produced a strange and surprising image. The unexpected behaviour turned out to be caused by a combination of reasons from signal processing and computer architecture. I describe the process that led to the pattern, explain its structure, and display many of the wonderful designs that can be produced from this and related tec...

متن کامل

The art of pedigree drawing: algorithmic aspects

MOTIVATION Giving a meaningful representation of a pedigree is not obvious when it includes consanguinity loops, individuals with multiple mates or several related families. RESULTS We show that finding a perfectly meaningful representation of a pedigree is equivalent to the interval graph sandwich problem and we propose an algorithm for drawing pedigrees.

متن کامل

My Parade of Algorithmic Mathematical Art

Animations are discussed for a range of geometric dissections. These include a variety of twist-hinged dissections, some swing-hinged dissections, dissections of squares and cubes corresponding to a certain integer identities, folding dissections of multi-level regular polygons, and folding dissections of multi-level polyominoes. Artistic issues pertaining to these dissections and animations ar...

متن کامل

On the Algorithmic Implementation of Multiclass Kernel-based Vector Machines

In this paper we describe the algorithmic implementation of multiclass kernel-based vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic objective function. Unlike most of previous approaches which typically decompose a multiclass probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arts

سال: 2018

ISSN: 2076-0752

DOI: 10.3390/arts7010003